ASYMPTOTIC BEHAVIOR FOR MArP/PH/2 QUEUE WITH JOIN THE SHORTEST QUEUE DISCIPLINE
نویسندگان
چکیده
منابع مشابه
ASYMPTOTIC BEHAVIOR FOR MArP/PH/2 QUEUE WITH JOIN THE SHORTEST QUEUE DISCIPLINE
Abstract This paper considers a parallel queueing model with two servers, where arriving customers join the shortest queue. In [14], we studied a similar queueing model, and obtained the tail decay rate of the stationary distribution by using the matrix analytic approach. The main objectives of this paper are to extend the result in [14] to a more general model, and to clarify difficulty when w...
متن کاملAsymptotic behavior for MAP/PH/c queue with shortest queue discipline and jockeying
This paper considers a parallel queueing model with heterogeneous servers, where an arriving customer joins the shortest queue and jockeying between queues is permitted. Based on the matrix analytic approach pioneered by Neuts, we obtain the tail decay rate of the stationary distribution for this queueing model.
متن کاملStability of join-the-shortest-queue networks
This paper investigates stability behavior in a variant of a generalized Jackson queueing network. In our network, some customers use a join-the-shortest-queue policy when entering the network or moving to the next station. Furthermore, we allow interarrival and service times to have general distributions. For networks with two stations we derive necessary and sufficient conditions for positive...
متن کاملDecay rate for a PH/M/2 queue with shortest queue discipline
In this paper, we consider a PH/M/2 queue in which each server has its own queue and arriving customers join the shortest queue. For this model, it has been conjectured that the decay rate of the tail probabilities for the shortest queue length in the steady state is equal to the square of the decay rate for the queue length in the corresponding PH/M/2 model with a single queue. We prove this f...
متن کامل5 A large deviation principle for join the shortest queue
We consider a join-the-shortest-queue model which is as follows. There are K single FIFO servers and M arrival processes. The customers from a given arrival process can be served only by servers from a certain subset of all servers. The actual destination is the server with the smallest weighted queue length. The arrival processes are assumed to obey a large deviation principle while the servic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2011
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.54.46